#include <iostream> 
#include <vector> 
using namespace std;
int n[7],dp[2100001] = {
	0
},sum = 0;
vector<int>v;
int main(){
	for(int i = 1;i<7;++i){
		cin>>n[i];
		sum+=i*n[i];
		
	}if(sum%2)
		cout<<"Can't be divided.";
	else{
		for(int i = 1;i<7;++i){
			for(int j = 0;n[i]>(1<<j);++j){
				v.push_back(i*(1<<j));
				n[i]-=v[j];
				
			}v.push_back(n[i]);
			
		}sum/=2;
		for(int i = 0;i<v.size();++i)
			for(int j = sum;j>=v[i];--j)
			dp[j] = max(dp[j],dp[j-v[i]]+v[i]);
		if(dp[sum]==sum)
			cout<<"Can be divided.";
		else 
			cout<<"Can't be divided.";
		
	}return 0;
	
}